SOJOURN TIME TEST OF m-SEQUENCES WITH CHARACTERISTIC PENTANOMIALS
نویسندگان
چکیده
منابع مشابه
Sojourn Time Asymptotics in the M / G / 1 Processor Sharing
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index ?, non-integer, ii the sojourn time distribution is regularly varying of index ?. This result is derived from a new expression for the Laplace-Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution. We ...
متن کاملAsymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue
We consider the M/M/1 queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer’s service requirement, in various asymptotic limits. These include large time and/or large service request, and heavy traffic, where the arrival rate is only slightly less than the service rate. The asymptotic formulas relate to, and extend, some results of Morriso...
متن کاملSojourn Time Estimation in an M/G/∞ Queue with Partial Information
We propose an estimator for the CDF G of the sojourn time in a steady-state M/G/∞ queueing system, when the available data consists of the arrival and departure epochs alone, without knowing which arrival corresponds to which departure. The estimator is a generalization of an estimator proposed by Brown (1970), and is based on a functional relationship between G and the distribution of the time...
متن کاملQueues with Equally Heavy Sojourn Time and Service Requirement Distributions
For the GGGG1 queue with First-Come First-Served, it is well known that the tail of the sojourn time distribution is heavier than the tail of the service requirement distribution when the latter has a regularly varying tail. In contrast, for the MMGG1 queue with Processor Sharing, Zwart and Boxma 26 showed that under the same assumptions on the service requirement distribution, the two tails ar...
متن کاملOn sojourn times in the finite capacity M/M/1 queue with processor sharing
We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. We give an exact expression for the sojourn time distribution in the finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K → ∞, by locating the dominant singularity of the Laplace transform. keywords: finite capacity, processor sharing, sojour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japanese Society of Computational Statistics
سال: 1995
ISSN: 0915-2350,1881-1337
DOI: 10.5183/jjscs1988.8.37